| Definitions | s = t, t  T, x:A  B(x),  x:A. B(x), EState(T), a:A fp B(a), f(a), Id,  , strong-subtype(A;B), P   Q, Type, EqDecider(T), Unit, left + right, IdLnk, x:A  B(x), EOrderAxioms(E; pred?; info), kindcase(k; a.f(a); l,t.g(l;t) ), Knd, loc(e), kind(e), Msg(M), type List,  , val-axiom(E;V;M;info;pred?;init;Trans;Choose;Send;val;time), r  s, e < e',  ,  b, constant_function(f;A;B), SWellFounded(R(x;y)),  , pred!(e;e'),   x,y. t(x;y), <a, b>,  A, pred(e), first(e), x. t(x), P & Q, Top, ES, AbsInterface(A), chain_config(), let x,y = A in B(x;y), chain_sys(Cmd), E, t.1, ||as||, a < b, e loc e' , P  Q, (e <loc e'), Sys(valid), sys-cmds(x), x.A(x), f'Ia, es-interface-history(es;X;e), #$n, A c B,  x:A. B(x), (x l), cmd-history(e), P  Q, P Q, e  X, case b of inl(x) => s(x) | inr(y) => t(y), if b then t else f fi , X(e), Void,  x:A.B(x), s ~ t |